Fault-Tolerant Information Sharing Networks
نویسندگان
چکیده
Agents are goal-driven entities, and the goal achievement is affected by the robustness of information supply required to achieve the goal. This research addresses fault tolerance in information sharing networks, and shows that the construction of information sharing networks, in the way that an agent can tolerate k concurrent information source failures, can be expressed as a constraint satisfaction problem. By solving the resulting constraint satisfaction problem, an agent can efficiently decide on the information sources from which to request the required information, so that the agent can achieve the goals even if a subset of the information sources fail.
منابع مشابه
Interconnecting Unstructured P2P File Sharing Networks
Currently there are a lot of public P2P file sharing networks in existence. Some of them have millions of users. There is a need for a system that can search and download from every P2P network. This article describes a novel structured interconnection system that works over multiple unstructured P2P file sharing networks and provides additional management features. This system works across dif...
متن کاملGATOSTAR: A Fault Tolerant Load Sharing Facility for Parallel Applications
This paper presents how and why to unify load sharing and fault tolerance facilities. A realization of a fault tolerant load sharing facility, GATOSTAR, is presented and discussed. It is based on the integration of two applications developed on top of Unix: GATOS and STAR. GATOS is a load sharing manager which automatically distributes parallel applications among heterogeneous hosts according t...
متن کاملReliable Peer-to-Peer Semantic Knowledge Sharing System
Reliability issues arise in Peer-to-Peer Semantic Knowledge Sharing (P2PSKS) systems. P2PSKS systems are prone to disconnection failures. Disconnection failures deprive the network peers from having access to complete knowledge in the PSPSKS system. Disconnection failures arise when the P2PSKS systems employ the adaptive query routing methods in order to avoid flooding the networks with redunda...
متن کاملLoad Sharing Replicated Buffered Banyan Networks With Priority Traffic
In this paper we investigate further the performance of a fault tolerant load sharing replicated buffered banyan network switch design. We look at the effect increasing the Switch Element (SE) degree has on the performance of the system and propose a simple modification to the system to transmit priority traffic. These results highlight the excellent performance and flexibility that these load ...
متن کاملGroup-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location
In the context of general demand cost sharing, we present the first group-strategyproof mechanisms for the metric fault tolerant uncapacitated facility location problem. They are (3L)-budget-balanced and (3L · (1 +Hn))-efficient, where L is the maximum service level and n is the number of agents. These mechanisms generalize the seminal Moulin mechanisms for binary demand. We also apply this app...
متن کامل